<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/graph_algorithms/basic_graph/graph_representation/adjlist_graph/adjlistgraph_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('adjlistgraph__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">adjlistgraph_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="adjlistgraph__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef ADJLISTGRAPH_TEST</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define ADJLISTGRAPH_TEST</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="adjlistgraph_8h.html">adjlistgraph.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#include&lt;memory&gt;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html">   24</a></span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">   25</a></span>&#160;    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>=10;</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;}</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_a_d_j_list_graph.html">IntroductionToAlgorithm::GraphAlgorithm::ADJListGraph</a>;</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="class_graph_a_d_j_list_test.html">   34</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_graph_a_d_j_list_test.html">GraphADJListTest</a>:<span class="keyword">public</span> ::testing::Test</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;{</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="class_graph_a_d_j_list_test.html#a72021ff735af11b1db48290ea0fa8a6b">   39</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_graph_a_d_j_list_test.html#a72021ff735af11b1db48290ea0fa8a6b">SetUp</a>(){</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <a class="code" href="class_graph_a_d_j_list_test.html#afcd2f035a4957685bc697f296bb2b4b5">graph</a>=std::make_shared&lt;ADJListGraph&lt;ADJ_NUM&gt; &gt;();</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    }</div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="class_graph_a_d_j_list_test.html#a79dc8e149913c35045b362c44a5fed46">   42</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_graph_a_d_j_list_test.html#a79dc8e149913c35045b362c44a5fed46">TearDown</a>(){}</div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;</div>
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="class_graph_a_d_j_list_test.html#afcd2f035a4957685bc697f296bb2b4b5">   44</a></span>&#160;    std::shared_ptr&lt;ADJListGraph&lt;ADJ_NUM&gt; &gt; <a class="code" href="class_graph_a_d_j_list_test.html#afcd2f035a4957685bc697f296bb2b4b5">graph</a>;</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;};</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div>
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">   51</a></span>&#160;<a class="code" href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">TEST_F</a>(<a class="code" href="class_graph_a_d_j_list_test.html">GraphADJListTest</a>,test_weight)</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;{</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            EXPECT_THROW(graph-&gt;weight(i,j),std::invalid_argument)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot;\t j:&quot;</span>&lt;&lt;j;</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;}</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;</div>
<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="adjlistgraph__test_8h.html#adffd83a26d2960a12f51e6b93c734c46">   63</a></span>&#160;<a class="code" href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">TEST_F</a>(<a class="code" href="class_graph_a_d_j_list_test.html">GraphADJListTest</a>,test_has_edge)</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;{</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;    EXPECT_THROW(graph-&gt;has_edge(-1,0),std::invalid_argument);</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    EXPECT_THROW(graph-&gt;has_edge(<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>,0),std::invalid_argument);</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;    EXPECT_THROW(graph-&gt;has_edge(0,-1),std::invalid_argument);</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    EXPECT_THROW(graph-&gt;has_edge(0,<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>),std::invalid_argument);</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;            EXPECT_FALSE(graph-&gt;has_edge(i,j))&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot;\t j:&quot;</span>&lt;&lt;j;</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;}</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;</div>
<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="adjlistgraph__test_8h.html#ab40ba8fbda34fb88e38fe419ee0fc705">   78</a></span>&#160;<a class="code" href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">TEST_F</a>(<a class="code" href="class_graph_a_d_j_list_test.html">GraphADJListTest</a>,test_add_edge)</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;{</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        {</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;            graph-&gt;add_edge(std::make_tuple(i,j,i*j));</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            EXPECT_TRUE(graph-&gt;has_edge(i,j))&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot;\t j:&quot;</span>&lt;&lt;j;</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;            EXPECT_EQ(graph-&gt;weight(i,j),i*j);</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        }</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        {</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;            EXPECT_THROW(graph-&gt;add_edge(std::make_tuple(i,j,9)),std::invalid_argument)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot;\t j:&quot;</span>&lt;&lt;j;</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        }</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;}</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;</div>
<div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="adjlistgraph__test_8h.html#a36f4e52ba65c2e5bc501e631687de66e">   98</a></span>&#160;<a class="code" href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">TEST_F</a>(<a class="code" href="class_graph_a_d_j_list_test.html">GraphADJListTest</a>,test_add_edges)</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;{</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    std::vector&lt;typename ADJListGraph&lt;ADJ_NUM&gt;::EdgeTupleType&gt; tuples;</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        {</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            tuples.push_back(std::make_tuple(i,j,i*j));</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        }</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    graph-&gt;add_edges(tuples.begin(),tuples.end());</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;            EXPECT_EQ(graph-&gt;weight(i,j),i*j)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot;\t j:&quot;</span>&lt;&lt;j;</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;}</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;</div>
<div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="adjlistgraph__test_8h.html#a5c2d014221c2625aa6658f2c059ea7dc">  117</a></span>&#160;<a class="code" href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">TEST_F</a>(<a class="code" href="class_graph_a_d_j_list_test.html">GraphADJListTest</a>,test_adjust_edge)</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;{</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                EXPECT_THROW(graph-&gt;adjust_edge(i,j,99),std::invalid_argument)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot;\t j:&quot;</span>&lt;&lt;j;</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        {</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            graph-&gt;add_edge(std::make_tuple(i,j,9));</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;        }</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        {</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            graph-&gt;adjust_edge(i,j,i*j);</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;            EXPECT_EQ(graph-&gt;weight(i,j),i*j)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot;;\tj:&quot;</span>&lt;&lt;j;</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        }</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;}</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;</div>
<div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="adjlistgraph__test_8h.html#a8060f1785ccafa43adb7cc6a12cc20cd">  139</a></span>&#160;<a class="code" href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">TEST_F</a>(<a class="code" href="class_graph_a_d_j_list_test.html">GraphADJListTest</a>,test_edge_tuples)</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;{</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;    std::vector&lt;typename ADJListGraph&lt;ADJ_NUM&gt;::EdgeTupleType&gt; real;</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    EXPECT_EQ(graph-&gt;edge_tuples(), real);</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;        {</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;            real.push_back(std::make_tuple(i,j,i*j));</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;            graph-&gt;add_edge(std::make_tuple(i,j,i*j));</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            EXPECT_EQ(graph-&gt;edge_tuples(),real)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot;\t j:&quot;</span>&lt;&lt;j;</div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;        }</div>
<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;}</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;</div>
<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="adjlistgraph__test_8h.html#acb9b9fedae51da94a0e9ca57b7457e28">  156</a></span>&#160;<a class="code" href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">TEST_F</a>(<a class="code" href="class_graph_a_d_j_list_test.html">GraphADJListTest</a>,test_vertex_edge_tuples)</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;{</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;        EXPECT_EQ(graph-&gt;vertex_edge_tuples(i).size(),0);</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;        {</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            graph-&gt;add_edge(std::make_tuple(i,j,i*j));</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        }</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;i++)</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;    {</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;        std::vector&lt;typename ADJListGraph&lt;ADJ_NUM&gt;::EdgeTupleType&gt; real;</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;<a class="code" href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">ADJ_NUM</a>;j++)</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        {</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            real.push_back(std::make_tuple(i,j,i*j));</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        }</div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        EXPECT_EQ(graph-&gt;vertex_edge_tuples(i),real)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    }</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;}</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="preprocessor">#endif // ADJLISTGRAPH_TEST</span></div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div>
<div class="ttc" id="class_graph_a_d_j_list_test_html_a79dc8e149913c35045b362c44a5fed46"><div class="ttname"><a href="class_graph_a_d_j_list_test.html#a79dc8e149913c35045b362c44a5fed46">GraphADJListTest::TearDown</a></div><div class="ttdeci">void TearDown()</div><div class="ttdef"><b>Definition:</b> <a href="adjlistgraph__test_8h_source.html#l00042">adjlistgraph_test.h:42</a></div></div>
<div class="ttc" id="class_graph_a_d_j_list_test_html_a72021ff735af11b1db48290ea0fa8a6b"><div class="ttname"><a href="class_graph_a_d_j_list_test.html#a72021ff735af11b1db48290ea0fa8a6b">GraphADJListTest::SetUp</a></div><div class="ttdeci">void SetUp()</div><div class="ttdef"><b>Definition:</b> <a href="adjlistgraph__test_8h_source.html#l00039">adjlistgraph_test.h:39</a></div></div>
<div class="ttc" id="namespaceanonymous__namespace_02adjlistgraph__test_8h_03_html_a398e679d6fa790bc3ff7d6a7c92a7d74"><div class="ttname"><a href="namespaceanonymous__namespace_02adjlistgraph__test_8h_03.html#a398e679d6fa790bc3ff7d6a7c92a7d74">anonymous_namespace{adjlistgraph_test.h}::ADJ_NUM</a></div><div class="ttdeci">const int ADJ_NUM</div><div class="ttdef"><b>Definition:</b> <a href="adjlistgraph__test_8h_source.html#l00025">adjlistgraph_test.h:25</a></div></div>
<div class="ttc" id="class_graph_a_d_j_list_test_html_afcd2f035a4957685bc697f296bb2b4b5"><div class="ttname"><a href="class_graph_a_d_j_list_test.html#afcd2f035a4957685bc697f296bb2b4b5">GraphADJListTest::graph</a></div><div class="ttdeci">std::shared_ptr&lt; ADJListGraph&lt; ADJ_NUM &gt; &gt; graph</div><div class="ttdef"><b>Definition:</b> <a href="adjlistgraph__test_8h_source.html#l00044">adjlistgraph_test.h:44</a></div></div>
<div class="ttc" id="adjlistgraph_8h_html"><div class="ttname"><a href="adjlistgraph_8h.html">adjlistgraph.h</a></div></div>
<div class="ttc" id="adjlistgraph__test_8h_html_a28b81e39dcdcd1b8a9d1d3127b635b68"><div class="ttname"><a href="adjlistgraph__test_8h.html#a28b81e39dcdcd1b8a9d1d3127b635b68">TEST_F</a></div><div class="ttdeci">TEST_F(GraphADJListTest, test_weight)</div><div class="ttdoc">adjlist_graph_test:测试ADJListGraph </div><div class="ttdef"><b>Definition:</b> <a href="adjlistgraph__test_8h_source.html#l00051">adjlistgraph_test.h:51</a></div></div>
<div class="ttc" id="class_graph_a_d_j_list_test_html"><div class="ttname"><a href="class_graph_a_d_j_list_test.html">GraphADJListTest</a></div><div class="ttdoc">GraphADJListTest:测试类，用于为测试提供基础数据 </div><div class="ttdef"><b>Definition:</b> <a href="adjlistgraph__test_8h_source.html#l00034">adjlistgraph_test.h:34</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_a_d_j_list_graph_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_a_d_j_list_graph.html">IntroductionToAlgorithm::GraphAlgorithm::ADJListGraph</a></div><div class="ttdoc">ADJListGraph：图的邻接表表示，算法导论22章22.1节 </div><div class="ttdef"><b>Definition:</b> <a href="adjlistgraph_8h_source.html#l00035">adjlistgraph.h:35</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_aa0a5ddea82682e3e6fbdbaa3337ee0e.html">graph_algorithms</a></li><li class="navelem"><a class="el" href="dir_7ed7dee3af3b488a5e053ec9bcb71f0e.html">basic_graph</a></li><li class="navelem"><a class="el" href="dir_d12496f1fc7378ee9aea361c57814de0.html">graph_representation</a></li><li class="navelem"><a class="el" href="dir_b9f111d5dc0c5f95961805062b678fac.html">adjlist_graph</a></li><li class="navelem"><a class="el" href="adjlistgraph__test_8h.html">adjlistgraph_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
